AVATAR: a new Architecture for First-Order Theorem Provers
نویسندگان
چکیده
AVATAR is a new architecture for first-order resolution and superposition theorem provers which tightly integrates the saturation loop with a SAT solver (or an SMT solver) to efficiently implement the clause splitting rule. AVATAR employes the SAT solver to pick splitting branches, thus delegating the propositional essence of the given problem to the dedicated solver. This leads to a combination which is shown to be highly successful in practice. Moreover, replacing the SAT solver with an SMT solver opens up the possibility for efficient reasoning with both quantifiers and theories.
منابع مشابه
AVATAR Modulo Theories
This paper introduces a new technique for reasoning with quantifiers and theories. Traditionally, first-order theorem provers (ATPs) are well suited to reasoning with first-order problems containing many quantifiers and satisfiability modulo theories (SMT) solvers are well suited to reasoning with first-order problems in ground theories such as arithmetic. A recent development in first-order th...
متن کاملCooperating Proof Attempts
This paper introduces a pseudo-concurrent architecture for first-order saturation-based theorem provers with the eventual aim of developing it into a truly concurrent architecture. The motivation behind this architecture is two-fold. Firstly, first-order theorem provers have many configuration parameters and commonly utilise multiple strategies to solve problems. It is also common that one of t...
متن کاملPlaying with AVATAR
Modern first-order resolution and superposition theorem provers use saturation algorithms to search for a refutation in clauses derivable from the input clauses. On hard problems, this search space often grows rapidly and performance degrades especially fast when long and heavy clauses are generated. One approach that has proved successful in taming the search space is splitting where clauses a...
متن کاملLogic-Based Subsumption Architecture: Empirical Evaluation (Status Report)
We describe an implementation of the Logicbased Subsumption Architecture (LSA) [Amir and Maynard-Reid, 1999], an AI architecture inspired by Brooks’ subsumption architecture but based on logic. In this architecture, layers of control are axiomatized in First-Order Logic (FOL) and independent theorem provers derive each layer’s goals given its inputs. Default assumptions in the lower layers impl...
متن کاملLogic-Based Subsumption Architecture
We describe a logic-based AI architecture based on Brooks’ subsumption architecture. In this architecture, we axiomatize different layers of control in First-Order Logic (FOL) and use independent theorem provers to derive each layer’s outputs given its inputs. We implement the subsumption of lower layers by higher layers using circumscription to make assumptions in lower layers, and nonmonotoni...
متن کامل